MODAL ENVIRONMENT FOR BOOLEAN SPECULATIONS ( preliminary report )
نویسندگان
چکیده
The common form of a mathematical theorem consists in that "the truth of some properties for some objects is necessary andlor sufficient condition for other properties to hold for other objects". To formalize this, one happens to resort to Kripke modal logic K which, having in the syntax the notions of 'property' and 'necessity', appears to provide a reliable metamathematical fundament. In this paper we challenge this reliability. We propose two different approaches each claiming better formal treatment of the state of affairs. The first approach is in formalizing the notion of 'sufficiency' (which remains beyond the capacities of K), and consequently of 'sufficiency' and 'necessity' in a joint context. The second is our older idea to formalize the notion of 'object' in the same modal spirit. Having 'property, object, sufficiency, necessity', we establish some basic results and profess to properly formalize the everyday metamathematical reason.
منابع مشابه
Structured Problems for Modal Satisfiability Testing∗ (Preliminary Report)
We report on ongoing experimental work on evaluating test sets for testing modal satisfiability solvers. Our longterm aim is to understand the difference between the use of structured and of unstructured randomly generated problems. Which parts of the problem space do they explore?
متن کاملA Correspondence Theory for Terminological Logics: Preliminary Report
We show that the terminological logic ACC comprising Boolean operations on concepts and value restrictions is a notational variant of the proposit ional modal logic K ( m ) To demonstrate the u t i l i t y of the correspondence, we give two of its immediate by-products, Namely, we axiomatize ACC and give a simple proof that subsumption in ACC is PSPACE-complete, replacing the original six-page ...
متن کاملKIT REPORT 91 A Correspondence Theory for Terminological Logics: Preliminary Report
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K(m). To demonstrate the utility of the correspondence, we give two of its immediate by-products. Namely, we axiomatize ALC and give a simple proof that subsumption in ALC is PSPACE-complete, replacing the original six-page one. Furt...
متن کاملFully Local and E cient Evaluation of Alternating Fixed Points ? ( Extended
We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the speci cation and evaluation of arbitrarily nested alternating xed points. The generality of PDGs subsumes that of similarly proposed models of nested xed-point computation such as Boolean graphs, Boolean equation systems, and the propositional modal mu-calculus. Our main result is an e cient local algorithm for eva...
متن کاملFully Local and Eecient Evaluation of Alternating Fixed Points ?
We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the speciication and evaluation of arbitrarily nested alternating xed points. The generality of PDGs subsumes that of similarly proposed models of nested xed-point computation such as Boolean graphs, Boolean equation systems, and the propositional modal mu-calculus. Our main result is an eecient local algorithm for eva...
متن کامل